Algorithmic Minimal Sufficient Statistic Revisited
نویسنده
چکیده
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which might have better properties.
منابع مشابه
On Algorithmic Strong Sufficient Statistics
The notion of a strong sufficient statistic was introduced in [N. Vereshchagin, Algorithmic Minimal Sufficient Statistic Revisited. Proc. 5th Conference on Computability in Europe, CiE 2009, LNCS 5635, pp. 478-487]. In this paper, we give a survey of fine properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much ...
متن کاملAlgorithmic Minimal Sufficient Statistics: a New Definition
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which has better properties.
متن کاملOn the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth of x, and can solve the Halting problem for all programs with length shorter than the m-depth of x. It is also shown that there are strings for which the al...
متن کاملAlgorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the information in the data, for example, a finite set (or probability distribution) where the data sample typically came from. The statistical theory based...
متن کاملar X iv : c s / 01 11 05 3 v 2 [ cs . C C ] 2 7 A ug 2 00 2 Meaningful Information
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the object and the information accounting for the remaining accidental information. There can be several ways (model classes) in which the regularity is expressed. ...
متن کامل